a high performance parallel ip lookup technique using distributed memory organization and iscb-tree data structure

the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a high performance parallel ip lookup mechanism based on distributed memory organization that uses p processor for solving lpm problem. since multiple processors are used, the number of prefixes to be compared for each processor has been reduced. in other words each processor needs to find lpm for a specific ip address among n/p of prefixes. in order to reduce the number of memory access in each processor which is a major bottleneck in ip lookup process, we use iscb-tree data structure for the sake of storing the forwarding table in each processor. iscbtree is a b-tree like data structure that reduces the height of prefix tree and logarithmic growing manner with the increasing number of prefixes. by the using of this data structure the number of memory access reduces sharply.